Modeling of Partial Digest Problem as a Network flows problem

نویسندگان

  • O. Ranjbar Department of Computer science, Faculty of Mathematics, University of Mazandaran, Babolsar, Iran
  • R. Nadimi Assistant Professor, Department of Computer science, Faculty of Mathematics, University of Mazandaran, Babolsar, Iran
چکیده مقاله:

Restriction Site Mapping is one of the interesting tasks in Computational Biology. A DNA strand can be thought of as a string on the letters A, T, C, and G. When a particular restriction enzyme is added to a DNA solution, the DNA is cut at particular restriction sites. The goal of the restriction site mapping is to determine the location of every site for a given enzyme. In partial digest method, all pairwise distances between restriction sites are produced. Mathematically, given pairwise distances between n points on a line segment, the goal is to find that points. This problem has been named Partial Digest Problem(PDP). In this paper we present a new model for PDP using generalized network flows. Since complexity class of this problem is one of the most important open problems in bioinformatics (there is no polynomial algorithm and no proof for Np-completeness) reducing to a network flow problem create a new viewpoint to challenge with this problem.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Continuous Optimization Model for Partial Digest Problem

The pupose of this paper is modeling of Partial Digest Problem (PDP) as a mathematical programming problem. In this paper we present a new viewpoint of PDP. We formulate the PDP as a continuous optimization problem and develope a method to solve this problem. Finally we constract a linear programming model for the problem with an additional constraint. This later model can be solved by the simp...

متن کامل

a continuous optimization model for partial digest problem

the pupose of this paper is modeling of partial digest problem (pdp) as a mathematical programming problem. in this paper we present a new viewpoint of pdp. we formulate the pdp as a continuous optimization problem and develope a method to solve this problem. finally we constract a linear programming model for the problem with an additional constraint. this later model can be solved by the simp...

متن کامل

the problem of divine hiddenness

این رساله به مساله احتجاب الهی و مشکلات برهان مبتنی بر این مساله میپردازد. مساله احتجاب الهی مساله ای به قدمت ادیان است که به طور خاصی در مورد ادیان ابراهیمی اهمیت پیدا میکند. در ادیان ابراهیمی با توجه به تعالی خداوند و در عین حال خالقیت و حضور او و سخن گفتن و ارتباط شهودی او با بعضی از انسانهای ساکن زمین مساله ای پدید میاید با پرسشهایی از قبیل اینکه چرا ارتباط مستقیم ویا حداقل ارتباط وافی به ب...

15 صفحه اول

The Simplified Partial Digest Problem: Hardness and a Probabilistic Analysis

Introduction We study the problem of genome mapping using restriction site analysis. In restriction site analysis, an enzyme cuts a target DNA strand into DNA fragments, and these DNA fragments are used to reconstruct the restriction site locations of the enzyme. Two common approaches are the Double Digest Problem and the Partial Digest Problem. The Double Digest Problem is known to be NP-Compl...

متن کامل

Noisy Data Make the Partial Digest Problem NP-hard

The problem to find the coordinates of n points on a line such that the pairwise distances of the points form a given multi-set of n 2 distances is known as Partial Digest problem, which occurs for instance in DNA physical mapping and de novo sequencing of proteins. Although Partial Digest was – as a combinatorial problem – already proposed in the 1930’s, its computational complexity is still u...

متن کامل

The Simplified Partial Digest Problem: Enumerative and Dynamic Programming Algorithms

We study the Simplified Partial Digest Problem (SPDP), which is a mathematical model for a new simplified partial digest method of genome mapping. This method is easy for laboratory implementation and robust with respect to the experimental errors. SPDP is NP-hard in the strong sense. We present an Oðn2Þ time enumerative algorithm (ENUM) and an OðnÞ time dynamic programming algorithm for the er...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 5  شماره 20

صفحات  63- 70

تاریخ انتشار 2019-11-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023